System and method for implementing non-blocking, concurrent hash tables

ABSTRACT

A computer-implemented method of resizing a data structure includes storing a first hash index comprising x elements, wherein x is a positive integer greater than two, determining that the first hash index needs to expand, allocating a second hash index, wherein the second index contains at least x+1 elements, attempting, by a first thread, to advance a first pointer from the first hash index to the second hash index, attempting, by a second thread, to advance the first pointer from the first hash index to the second hash index, where only one of the first thread or the second thread will advance the first pointer based on an atomic operation.

PRIORITY CLAIM

The present application claims priority to the following U.S. provisional applications: Ser. No. 62/265,006 filed Dec. 9, 2015, which is incorporated herein by reference in its entirety.

BACKGROUND

Concurrent computing environments use ever more powerful and complex multicore and/or multi-CPU platforms, with highly multithreaded operations. Especially where multiple and simultaneous producers (e.g., writers) and consumers (e.g., readers) operate on a given memory structure, this heightens the risk of process and/or thread contention, latency, and inefficient memory usage. As a result, concurrent computing can be associated with significant performance constraints. Such constraints can slow current processes and impose an opportunity cost of foregone added ones.

Hash tables have been used in high performance systems as a means of mapping a key to a specific value with constant amortized cost in terms of timing per read and write operation. Hash tables may be used to implement both sets and associative map data structures. With the rise of multi-core processors, there is an increasing emphasis on lock-free algorithms in order to reduce the contention introduced by managing concurrency using locks. Most of the current approaches to implementing lock-free hash tables use a closed addressing approach based on the use of lock-free linked lists.

Mechanisms have been designed to address these constraints. These include locking mechanisms that can selectively brake producers so that consumers can “catch up.” Disadvantages of locking mechanisms are known and can include significant wait times, thread stalls or thread death, and limited scalability. A lock-free mechanism, however, presents challenges as well, including the A-B-A problem, where state can appear identical from a first read to a second read, but in fact a separate process has “secretly” modified shared memory before changing it back again.

SUMMARY

Disclosed herein are systems and methods for implementing lock-free hash tables using an array-based, open addressing approach. At least some of the design issues the array-based, open addressing implementations overcome are those regarding the inability to dynamically resize and the prevention of duplicates. Specifically, the present disclosure outlines systems and methods of efficiently operating a memory in a computing system, in particular through the use of a hash table with hash sets or hash maps.

Hash tables can be used to either implement a hash set or an associative hash map. With hash sets, a goal is to test the set for membership of the key. In one embodiment, the key is simply an integer value or pointer address that can be contained within an array bucket slot itself. In another embodiment, the key could be an arbitrarily long string of bytes, for example, and the content of an array bucket is a pointer to the memory containing the key. In another embodiment, the key and value are identical, and the implementation encompasses the case where the key is no longer than the natural size of a system pointer or equivalently sized integer that fits in an index slot. Since the key fits in an index slot, the hash set will have no issue with being updated or read by multiple processes or threads, which may be an issue for associative maps.

Techniques for managing hash buckets in a hash table are also disclosed herein, which work in a non-blocking fashion and control updates in such a way as to guarantee that the updates can be moved in a non-blocking fashion with simultaneous adds and deletes occurring while also insuring that a look up will find a particular update.

The present disclosure provides systems and methods to update the hash set or hash map in a coordinated, thread-safe manner. In one embodiment, the system and method allows for a standard “put” and/or “remove” as in other embodiments, but it may lead to a model of “last write wins” by competing threads which is useful in some circumstances, though limited in other multithreaded/multiprocess coordination scenarios. In one embodiment, the add/update/delete functions provide a mechanism for thread safe updates based on the versioning of the key/value pairs. The “add” function may be a unique add that insures that no other thread has added a key/value pair with a specified key, otherwise, that other thread may fail. In addition, the update/delete functions allow specifying a previous version of the key/value pair that is expected to be present in the associative map, while the functions may fail otherwise. These features allow the hash map to be updated in a thread-safe fashion such that a thread can add/update/delete successfully only if the key/value pair state has not been altered by another thread.

In another embodiment, a hash map implementation is disclosed that is different than a hash set implementation while the hash map builds on the hash set design. As with a hash set, a hash map has several possible variations. Instead of the key and value being identical, the key has a separate reference to a memory item used for a value and another reference to a specified key of arbitrary length, which has to be copied for thread safety purposes. According to embodiments, there are additional memory management and thread safety issues to address with a hash map implementation. In addition, a hash map interface may be more complex than a hash set implementation because it allows both for a simpler, single source update interface and also allows for a more complex set of algorithms that allow for updates from multiple sources. In one embodiment, a hash map design is able to enforce an atomic, unique add as well as being able to detect and prevent simultaneous updates and deletes. As mentioned herein, an operation (or set of operations) is atomic if it appears to the rest of the system to occur instantaneously. The atomic nature of the operation provides a guarantee of isolation from concurrent processes.

In one embodiment, a hash function associated with a hash set or hash map deals with an integral value and simply proceeds through a number of shifts based on the size of the hash index it is targeting in order to evenly distribute the keys in the hash index. The initial implementation for the hash map, the hash function converts the key to an integer by a series of multiplications by the value of 33 and additions of key bytes called ‘times 33’. The design is not dependent on any particular hash function.

The embodiments disclosed herein for both the non-blocking hash set and non-blocking hash map have proven to be effective and practical implementations that address the cited design problems and objections. In addition, these designs, in particular the hash map, provide capabilities not found in other approaches by providing the ability to handle modifications by multiple sources with its ability to detect collisions. The hash set has proved useful in implementing a multi-threaded memory pool for tracking large blocks of allocated memory that are not managed directly by the pool, and also providing efficient mechanisms for debugging memory allocation issues without affecting application performance.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 illustrates an example computing environment according to an embodiment.

FIG. 2 is an embodiment of code that defines the basic data structures used in an embodiment of a non-blocking hash set.

FIGS. 3-4 illustrate an embodiment of the present disclosure whereby the size of a hash index is adjusted using a hash set.

FIG. 5 is a flowchart of an embodiment of a method for resizing a hash index.

FIG. 6 is an embodiment of code that creates and initializes the data structures shown in FIGS. 3 and 4.

FIG. 7 is an embodiment of code that performs operations that update a hash set.

FIG. 8 is an embodiment of code that performs an internal add operation according to an embodiment.

FIG. 9 is code that performs operations to convert a value and return a specific block in a hash index according to an embodiment.

FIG. 10 is an embodiment of code that performs operations to transfer a block of values from one hash index to another hash index according to an embodiment.

FIG. 11 is an embodiment of code that performs a query on a hash set according to an embodiment.

FIG. 12 is an embodiment of code that removes a value from a hash set according to an embodiment.

FIG. 13 is an embodiment of code that defines the structures of a hash map.

FIG. 14 illustrates an embodiment of the structures of a hash map defined by the code in FIG. 13.

FIG. 15 is an embodiment of code that performs operations related to initialization, allocating, and deallocating of a hash map.

FIG. 16 is an embodiment of code that takes a key and returns a block of a hash map.

FIG. 17 is an embodiment of code that defines a structure regarding operations performed on a hash map.

FIG. 18 is an embodiment of code that performs an operation of placing a key value pair in a hash map.

FIG. 19 is an embodiment of code that performs an operation to update an existing key value pair in a hash map.

FIG. 20 is an embodiment of code that performs an operation to allocate a key value pair in a hash map.

FIG. 21 is an embodiment of code that performs an operation to deallocate key value pairs whose release have been differed in a hash map.

FIG. 22 is an embodiment of code that performs add and remove operations and deallocation of associated memory in a hash map.

FIG. 23 is an embodiment of code that performs an operation to check if a hash map is being resized and if so, transfer a block from one hash index to another.

FIG. 24 is an embodiment of code that performs an operation to transfer a block from one hash index to another.

FIG. 25 is an embodiment of code that performs an operation that rehashes from one hash index to another.

FIG. 26 is an embodiment of code that performs an operation that expands hash indexes of a hash map.

FIG. 27 is an embodiment of code that performs an operation that advances pointers in a hash map.

FIG. 28 is an embodiment of code that performs a query on a hash map for a specified key that returns a value.

FIG. 29 is an embodiment of code that performs an operation that compares a query key to a key in a key value pair.

FIG. 30 is an embodiment of code that performs an operation that removes a value associated with a key in a hash map.

FIGS. 31a-b are an embodiment of code that performs a unique add that succeeds only if a key in a hash map does not exist.

FIG. 32 is an embodiment of code that performs an operation that updates a key value pair in a hash map only if a preexisting state is still valid.

FIG. 33 is an embodiment of code that performs an operation that deletes a value that matches a key in a key value pair of a hash map only if a preexisting state is still valid.

DETAILED DESCRIPTION

In the following description, reference is made to the accompanying drawings which illustrate several embodiments of the present invention. It is understood that other embodiments may be utilized, and mechanical, compositional, structural, electrical and other operational changes may be made without departing from the spirit and scope of the present disclosure. The following detailed description is not to be taken in a limiting sense, and the scope of the embodiments of the present invention is defined only by the claims of the issued patent.

FIG. 1 depicts an example architecture in accord with embodiments. System 100 comprises computing functionality, both local and distributed. System 100 may have a unit 102 comprising one, two or more central processing units 104,106, which can be considered processors. Unit 102 can be a server or servers. A processor can be single-core 104, or have multiple cores 108, 110 where more than one processor can be placed on a “chip”. The processor 104, 106 can execute instructions by many techniques, in concurrent processes and threads. Many variations of multiprocessor and/or multicore systems can be used. There may be multiple memory components. Certain memory components can be considered main memory 120, which may be shared among one or more processors 104, 106. Other memory components can be considered cache memory 112, 114, 116, 118, which may be more closely associated with a specific processor 104, 106. Caches can be divided into levels, e.g., L1 cache 112, 114, L2 cache 116, 118, and more. A bus 130 or other interconnection functionality can permit communication within and beyond a system. An additional unit 124 with comparable functionality can be in operative communication with a first unit 102. There can be display and input/output functionality 122. Also, a network or networks 126 can be present. Additionally, outside memory 128 or memories can be utilized. It will be readily appreciated that many interoperative variations, configurations, and architectures can be employed in accord with embodiments disclosed herein.

FIG. 2 is code that defines the basic data structures shown in FIGS. 3-4, used in a non-blocking hash set. The main structure is the hash_index, which consists of a header portion followed by an array of cache line aligned blocks. The size of the array of cache line aligned blocks can be tuned based on performance. The cache line aligned blocks may be allocated in counts that are a power of two and are cache line aligned. Being a power of two makes computing the index of the relevant block from the computed hash an efficient masking operation. The header portion contains a pointer to the next hash_index structure if it exists. The next hash_index structure may contain twice the number of blocks. There is a null value slot that is used for comparing to null slots that is set to the NULL_BLOCK value when items are no longer allowed in the current hash_index during a resizing operation. The size is the number of items currently stored in the hash_index. The capacity is the number of blocks in the hash_index and the shifts value is the precomputed number of shifts to be used for calculating the block index. The t_index value is used for indicating the next block that needs to be transferred to a larger hash_index during resizing. Finally the pad bytes keep things aligned on cache line boundaries for memory access efficiencies. The associated array of indexing blocks are appended to the header.

The mem_set structure consists of three pointers which are used to maintain a list of hash_index structures. The head pointer always references the start of the list, and the write pointer is the end of the list and the current hash_index where new items are currently being added. The read pointer references refers to the first hash_index with active items that have not yet been transferred to the current writing hash_index. The accessors value is a reference counter of the active number of readers and writers that might actively be referencing the hash indexes, which is needed to know when to safely released older, unused indexes. Finally, the size is the total number of items contained in all the referenced hash indexes.

FIGS. 3-4 depict a sequence of state changes illustrating a relationship between a hash set and associated hash index, and more specifically how added hash indexes can be declared and utilized upon detection of a potential overflow condition and how pointers in a queue can adjust accordingly. FIG. 3 depicts an example hash set state upon initialization. By way of non-limiting example, capacity in hash index 1 is set to 4. FIG. 4 depicts an example state upon detection of a first overflow and shows the hash set structure during a resize operation when the hash_index overflows. It is noted that in FIG. 4, capacity of hash index 1 is 4, and hash index 2 is 8, in accord with embodiments where the newly allocated hash index has double the capacity. The overall data structures can be seen in FIGS. 3-4, and aspects are similar to a resizable ring buffer queue design described in International Patent Publication No. WO2014201408 and U.S. Patent Application Publication No. US2016/070535, each entitled “QUEUEING DATA FOR MULTIPLE READERS AND WRITERS”, the entireties of which are incorporated by reference herein.

As shown in FIGS. 3 and 4, a hash set structure 302 is utilized. Hash set structure 302 can have a reader portion and writer portion aligned to be in separate cache lines. The hash set structure 302 consists of three pointers which are used to maintain a list of hash index structures. Head pointer 304 points to the first hash index 314 in the linked list of hash indexes 314, 414 and read pointer 306 can point to the hash index currently being drained of items. The head pointer 304 always references the start of a list, and the write pointer 308 is the end of the list. The accessors value 310 is simply a reference counter of the active number of readers and writers that might actively be referencing the hash indexes, which is needed to know when to safely released older, unused indexes. Finally, the size 312 is the total number of items contained in all the referenced hash indexes.

Furthermore, the main data structure is the hash index 314, 414 which consists of a header portion followed by an array of cache line aligned blocks. The size of the array of cache line aligned blocks can be tuned based on performance. The cache line aligned blocks may be allocated in counts that are a power of two and are cache line aligned. Being a power of two makes computing the index of the relevant block from the computed hash an efficient masking operation. The header portion contains a pointer to the next hash index structure, if it exists, such as hash index 2 shown in FIG. 4. As illustrated in FIG. 4, the hash index 2 structure 414 contains twice the number of blocks as the hash index 1 structure 314. There is a “null” value slot that is used for comparing to null slots that is set to the NULL_BLOCK value when items are no longer allowed in the current hash index during a resizing operation. The “size” is the number of items currently stored in the hash index. The “capacity” is the number of blocks in the hash_index and the “shifts” value is the precomputed number of shifts to be used for calculating the block index. The “t_index” value is used for indicating the next block that needs to be transferred to a larger hash index during resizing. In addition, “padding” can be used to reduce the possibility of conflict due to cache line sharing. A next field pointer 402 is depicted. Additionally, pad bytes may be used to keep things aligned on cache line boundaries for memory access efficiencies. The associated array of indexing blocks may be appended to the header.

FIG. 5 is a flowchart illustrating a method 500 to add to or increase the size of a current hash index. The method demonstrates how the system can dynamically adjust utilizing a logical perspective if the hash index—which has a finite number of buckets from a physical perspective—becomes full. It is clear that if buckets of the hash index become progressively filled then, given the nature of the data structure, physical overflow is possible unless measures are taken. Accordingly, a determination can be performed to establish whether an overflow condition has been encountered, i.e., the hash index is full. In other words, a check is made whether it is acceptable to keep writing to the current hash index.

As shown, an attempt is made at 502 to set a current hash index null value to not null to block more write to the current hash index. The system then allocates at 504 a new hash index that is greater in size than the current hash index. The system allocates a second larger hash index once the first ring buffer is determined to be full, and additional data can be written directly to the new hash index, while at the same time existing data can be drained from the first hash index as it is required. In one embodiment, the size of the new hash index is twice the current hash index.

A determination is made at 506 as to whether the hash index allocation was successful. If it wasn't successful, this means that there is not sufficient memory available and the system returns 508 a result that indicates there is not sufficient memory. For example, the result can be set to NOMEM indicating out of memory. If the hash index allocation was successful, then a “next” local variable is set 510 to equal a current hash index next pointer. Accordingly at least a second, expanded hash index has been allocated. Additional hash indexes may be allocated by additional threads as well. A determination is then made at 512 as to whether the next pointer is empty. If the next pointer is not empty, then at 516 an attempt is made to advance the current hash index write pointer to the next hash index pointer with a CAS operation. Another allocated hash index can then be freed or deallocated at 518. If the next pointer was determined to be empty, then a determination is made at 514 if a CAS with the last hash index in a linked list of hash indexes (which may be the second of two hash indexes) was successful. If it was unsuccessful, then an attempt is made at 520 to advance the current hash index write pointer to the allocated hash index with a CAS and another allocated ring buffer is freed or deallocated at 518. Once the allocated hash index has been synchronized properly with a hash set, the computing system may carry on almost immediately following the allocation of a new hash index. Accordingly, the allocated hash index may have data written to the slots of the buckets of the allocated hash index following alignment of the pointers described above. The functionality described above can be extended upon further iterations through the procedure such that multiple hash indexes can be dynamically allocated as needed, each larger in size than the prior one (any size that is larger than the prior one will suffice).

The hash_set_create function in FIG. 6 creates and initializes the set of structures in FIGS. 3-4. The hash_set_release function releases any partially instantiated hash set. The key to making the hash set work in a non-blocking fashion is in the cache_line_block struct which consists of an update counter, a bit map of occupied slots in the block, and a number of slots defined by BLOCK_COUNT constant. According to embodiments, the BLOCK_COUNT can be arbitrarily defined. In one embodiment, the BLOCK_COUNT constant is defined to be long enough, along with the update counter and bit map, to occupy two cache lines. Each hash index has an array of blocks, and every operation computes a block index based on hashing the key which will resolve to a specific block in the array based on a masking operation. The bit map indicates which slots are actively occupied and can be compared against. The update counter is atomically incremented every time the bit map value is modified so that operations updating can detect when the bucket contents has changed and can retry the operation. This can best be seen by examining the operations that update the hash set starting with the add function in FIG. 7.

In FIG. 7, lines A10 to A27 are the lines where the atomic add takes place starting and ending with the Atomic Fetch and Add (AFA) which increments the accessor count and the Atomic Fetch and Subtract (AFS) which decrements the accessor count. Lines A29 through A45 check first that the accessor count for the set is zero which means it is safe to update the hash_index list, and then lines check to see if the read pointer needs to be advanced to next hash_index in the list. The Compare and Swap (CAS) instruction on line A33 does the atomic update to the next hash_index in the list. Lastly, lines A36 through A44 determine if the head pointer needs to be advanced and the first hash_index is freed if the CAS at line A41 succeeds insuring only a single process performs the release of the memory.

Between incrementing and decrementing the accessor count, two operations are performed. On lines A11 through A17, the function internal_add is called, and the returned value checked A15. If there is a conflicting update detected, it is converted to a successful operation since it is not an error to add an item to set that is already contained in the set. Lines A19 through A26 a check is made for an expanded hash index indicating a resize is needed and attempts to transfer a block from the current read hash_index to the current write hash_index for the set.

On line A11, the function internal_add is called to add the item to the set, and the logic for that function is listed in FIG. 8. Line I07 of FIG. 8 shows an endless loop that aids in retrying steps when an attempt to add the item fails, which is a pattern repeated in all functions that update the hash set. The three places that the loop can be exited are on line I22 with an update conflict since item is already in set, a successful add on line I48, and an out of memory condition on line I67 when attempting to expand the hash set. Lines I10 through I30 are a do/while loop that will loop through the list of hash indexes till it hits the end of the list. Line I11 computes the block index based on shifting the key value and masking off the higher order bits performing a power of 2 modulo operation as seen in FIG. 9. The saving of the update counter and bit map at lines I13 and I14 prevent any modifications that might add a duplicate before the actual update in lines I31 through I48.

Lines I19 through I28 loop through the slots in the block, first testing the bit map value in line I20 before comparing at line I21. This order is critical for being able to add and remove items from the block in a lock-free fashion while still being able to detect changes to the block that will require retrying an operation. If the values match, an update conflict indicator is immediately returned. Lines I23 through I26 check to see if an empty slot is not found and if the slot is empty, recording the slot and bit position in the bit map. Line I27 shifts the bit mask one position before advancing to look at the next slot. If the for loop completes then the current hash index does not contain the value, and if the do/while loop on line I30 terminates then no hash index in the hash set contains the value.

Lines I33 through I49 attempt to add items not found in the hash set by the test on line I31. On line I32, the CAS attempts to add the value to the empty slot, and will retry by continuing at the top of the loop on line I33. Lines I34 through I40 set up and execute a Double Word Compare and Swap (DWCAS) instruction updating the first two slots of the block which contain an update counter and the bit map of occupied, active slots. The update counter is incremented and the bit map is updated by or operation with the current position mask. Lastly, the previous bit map is updated by or operation with current null value, which would be changed if a new hash index was added, thus blocking any new add to current hash index if the null value for the hash_index has been changed. If the DWCAS fails, the value is cleared from the previously occupied slot because another value has been added to the block and the process continues at the top of the retry loop. Thus, no value can be added without comparing against every value currently in the block. Lines I41 through I48 are executed if bit map updated successfully making item active. The current block, the slot within the block, and position mask are set before returning success indicator.

Lines I50 through I67 attempt to add an expanded hash index to the hash set when no empty slot is found to add an item to the current hash index. Line I51 alters the null value with the blocking value preventing any more adds to the current hash index. Then a new hash index is allocated with a block array that is twice the size of the current one on line I52. Lines I57 through I65 attempt to append the hash index to the end of the hash index list, and if it doesn't succeed attempts to aid the add operation initiated in another process on line I63 and frees the no longer needed hash_index allocation on line I64.

The internal_add function is also called by the transferBlock function in FIG. 10, which was invoked on line A24 of the hash_set_add in FIG. 7 when the hash set is being resized with an expanded hash_index structure. The current block to be moved is determined on line T18 by incrementing the stored value in the hash_index and performing a power of 2 modulo operation by masking off higher order bits based on the number of blocks in the array. This step may be taken to minimize contention by having the next thread work the adjacent block till the entire contents of the hash_index has been moved to the larger hash_index instance.

Lines T23 through T58 loop through the entire block, testing the bit map for active item at line T28, and the existence of the item at line T32, before attempting to add to larger hash_index by calling internal_add on line T37. On line T44, the DWCAS is an attempt to update the bit map and update counter with the bit map value that was cleared on line T43. If the update fails, it is because another thread has updated that block so the do/while loop updates the bit map using the new block location returned from the internal add call will retry until it succeeds and the value cleared on line T52. The thread returns at that point because it detected contention by being unable to update the bit map. If the update of the bit map on line T44 succeeds, line T55 clears the value and the loop advances to the next position until the entire block is cleared.

FIG. 11 presents the membership test function hash_set_has_value, which is simpler than the functions with modify the hash set. After accessing the current read hash_index, it simply hashes the value to the correct block, and then scans the block looking for the value. The do/while loop from line H15 to line H29 insures that if there is more than one hash_index in the list, that all are scanned if it is not found in a preceding hash_index. Lines H20 and H21 test the bit map before comparing the value, and if the value matches then result is set to true and exits the loop at line H23. If all hash indexes are scanned without finding a matching value the result defaults to false. Lines H31 through H38 check to see if a resize is occurring and transfer a block, as described for hash_add. The same applies to lines H41 through H58 where the identical check for advancing the hash_index list pointers is performed, as in all the hash set access functions.

The hash_set_remove function in FIG. 12 is structured much the same way as the search for membership, but instead of simply returning true if found the value is removed instead. So lines R12 through R41 loop through the hash_index list starting from the current read position. For each hash_index structure, the correct block is calculated at R14, and then the block is scanned in lines R19 through R39. Each bit in the bit map is tested on line R20 and the value compared for a match at line R21.

The update counter and bit map are modified in lines R22-23 and the DWCAS attempts to record the change on line R24. If the atomic update fails because another process modified the block, the new update counter and bit map are saved on lines R25 and R26 and the mask and index value are restored to values that will restart the scan at the beginning of the block and the loop continued. If the DWCAS succeeds, it is safe to clear the value by simply assigning a null value on line R31 and return a success indicator. The remaining lines implement the incremental resizing and updating of the hash_index list as previously described.

Regarding an embodiment of the present disclosure involving a hash map, the structures used in the hash map are defined in FIG. 13. The root structure is the hash_map, which has a number of additional fields defined relative to the hash set structure previously described. In addition to the accessors field, which acts as a reference count of accessing processes, there is the list of hash_index structures maintained by head and end pointers with the start pointer pointing to the first active index in the list. The hash_index is very similar to the one used for the hash set, with one exception. Instead of using one 64 bit pointer slot for update counter and another for the bit map, the hash map implementation combines them into a single 64 bit pointer slot using the block_cntrl union in order to save space and increase the number of available slots so the BLOCK_COUNT value used is 15. Other than that difference, the hash_index is essentially identical to the hash_index used in the hash set.

Because the hash map tracks key/value pairs, which cannot be stored in a hash_index slot like the hash set, the hash_index in this case always stores a pointer to a pair_ref struct, which takes 64 bytes to match a cache line on a 64-bit CPU to minimize cache sharing when updating a key/value pair. The kv_buffer pointer points to the last allocated pair_ref buffer used to allocate pair_ref structs as the first item in a linked list of buffers that acts essentially as a pushdown stack to track the buffers. The defer pair list maintains a linked list of pair_ref structs that have been removed from the map, but still have active processes still referencing them. The avail pair list is the list of available pair_ref structs that have no active references and can thus be reused.

The first field in a pair_ref is a next field since pair_refs that are removed from the map are added to a linked list. The count field is used as a tag field to prevent occurrences of the ABA update problem, where a state can appear identical from a first read to a second read, but in fact a separate process has “secretly” modified shared memory before changing it back again. The value pointer points to the memory location that represents the value to be associated with the key. The version field tracks the current version of the item which will be shown to allow updates to occur from multiple sources. The key pointer points to the allocated copy of the key field associated with the value, and the refs field acts as a reference counter of processes accessing the key for comparison. The length field is the length of the allocated memory for the key, and the padding field is simply to round out the size of the struct to 64 bytes to fill a cache line.

The pair_list structure used for both the avail list and the defer list consists of a head pointer and a tail pointer along with their respective tag counters that allow the lock-free adding and removing of pair_ref structures through the use of a DWCAS instruction. The counters prevent the ABA update problem.

The pair buffer struct is the header at the front of every pair_ref allocation buffer, and it is sized to take a cache line itself to maintain cache line alignment. The next pointer is used to maintain the push down stack linked list by pointing to the next buffer in the list. The max value is the total count of pair_ref instances in the buffer, and the current value is the last one that was allocated from the buffer. Once a pair_ref is initially allocated, it eventually is added to the avail list if it is freed and will always be reallocated from the avail list from that point on.

FIG. 14 is a conceptual diagram of the relationship of the structures, and the code in FIG. 15 creates a basic hash map and also releases at a minimum a partially or wholly complete hash map. As shown in FIG. 14, the root structure is the hash map 1402, which has a number of additional fields defined relative to the hash set structure 302 previously described. In addition to the accessors field 1410, which acts as a reference count of accessing processes, there is the list of hash index structures maintained by head pointer 1404 and end pointer 1408 with the start pointer 1406 pointing to the first active hash index 1420, shown as hash index 1, in a list. The size 1412 is the total number of items contained in all the referenced hash indexes. The hash index 1420 may be similar to the one used for the hash set. However, in one embodiment, instead of using one 64 bit pointer slot for an update counter and another for a bit map, the hash map 1402 implementation shown in FIG. 14 combines them into a single 64 bit pointer slot to save space and increase the number of available slots.

Because the hash map 1402 tracks key/value pairs 1428, 1430, 1432, which cannot be stored in a hash index slot like the hash set, the hash index in this case always stores a pointer to a pair ref struct 1426, which takes 64 bytes to match a cache line on a 64-bit CPU to minimize cache sharing when updating a key/value pair. The kv_buffer pointer 1418 points to the last allocated pair ref buffer 1428 used to allocate pair ref structures as the first item in a linked list of buffers 1426 that acts essentially as a pushdown stack to track the buffers 1426. The defer pair list 1416 maintains a linked list of pair ref structures that have been removed from the hash map 1402, but still have active processes still referencing them. The avail pair list 1414 is the list of available pair ref structures that have no active references and can thus be reused. FIG. 14 shows the initial allocated hash index with an array of four blocks, with one slot in a block pointing to the first pair_ref in the pair buffer 1426 which has pointers to the key 1436 and value 1434. There is also an item on the avail list 1414 and an item on the defer list 1416.

Most key/value associative arrays, or maps, have a pretty basic set of primitives that make up their interface. The basic functions consist of “put” to add a value associated with a key, “get” to retrieve item associated with a key, and “remove” to delete an item associated with a key. When used with lock-free hash maps, these primitives have limitations in that both the “puts” and “removes” can be safely to originate from a unique source for any given key or that the update order doesn't matter and the last update always is the valid state. The reason for that restriction is that these basic functions, while performing all updates atomically, because of concurrency they cannot detect that another process has made changes to the state of the map since any possible query. Essentially all maps implement these basic operations and so do the embodiments described herein.

Before getting into the “put” algorithm, FIG. 16 is the function that computes the block index for any given key that is used in all the functions. It simply calls one of the functions from a library, such as for example the lookup3 library written by Bob Jenkins, which produces an integer from the key. The value returned is then masked off using the size of the array for the index to essentially perform a power of 2 modulo operation.

FIG. 17 is the result structure that is returned by the functions. The status returns an integer status value indicating the success or reason for failure of the operation. The value pointer is used for those functions that return the value. The state acts as a version number for the current value associated with the key and is not used in the basic functions. The next section which describes the multi-source update interface will describe how that field is used.

The hash_put function is presented in FIG. 18. The essence of the algorithm takes place between the increment and decrement of the accessors reference count in lines P11 and P72 respectively. The while loop from lines P12 to P70 is there to provide a simple mechanism for retrying the operation when needed as conflicting updates arise.

The do/while loop from line P16 to line P37 simply steps through the list of hash_index structures, computing the respective block for each index at line P17, and then scanning the block in the for loop on lines P22 to P35. The “if” statement at line P23 tests the respective bit in the bit map for that slot. If the slot is active, the ref to the pair_ref struct is loaded and passed to the update_existing function on line P26. If the update_existing returns something other than a NOT_FOUND status then the process breaks out of the for loop and will subsequently exit the do/while loop test on line P37. If the slot was not active on line P23, lines P30 through P33 check for an empty slot and record the first slot it finds, and the mask for current slot in the bit map is shifted before continuing at the top of the loop to examine the next slot in the block.

Line P38 checks for a success which means that the “put” succeeded in overwriting an existing item and breaks out of the outer while loop. Line P40 checks for a retry status and continues at the top of the while loop at P12.

The “if” statement at line P43 is executed if a matching item was not found in the block and tests if an empty slot was found in the block. Lines P44-P64 attempt to add an item to the empty slot. First a pair_ref is allocated and initialized at P44. On lines P50-P53, an attempt is made to atomically add the ref pointer to the empty slot and if not release the pair_ref struct and retry the “put” because another process grabbed the slot first. Lines P54-P60 attempt to update the bit map of active slots, and if it fails return the pair_ref struct and clear the slot because another process succeeded in updating the block. That means the “put” needs to be tried again because the key needs to be compared against the newly added item to the block. If the process reaches line P61 it has succeeded so increments size count and proceeds to exit the retry loop.

The process only reaches line P67 if no item matches and no empty slot is found in the block in which case it calls expand_index function to allocate a new, larger hash_index and start the incremental resizing operation. Line P71 calls the check_resize function to see if there is a current resize taking place and aid the process by attempting to copy data to the larger hash_index. The call to check_index on line P73 checks to see if it is safe to release any unused hash indexes or to advance the current start of active indexes.

FIG. 19 is the function update_existing referenced by hash_put that compares a key against an existing item and updates if there is a match. Lines U07 and U35 update the reference count for the key to prevent the key from being released if another process removes the item from the map concurrently. Line U12 performs the compare of the key with the key from the pair_ref structure. The test at U14 compares the passed in state and if it doesn't match returns an UPDATE_CONFLICT status along with the actual state value. Since the hash_put always passes in 0, the state is never compared and accordingly this path is never taken. Lines U21 through U31 attempt to update the value with the passed in value since the keys have matched, and a RETRY status is returned if it fails, otherwise, returns a SUCCESS status along the replace value and the current state.

If the hash_put function does not find a value and has an empty slot in the block, it allocates a new pair_ref structure on line P44 by calling the allocate_key_value function in FIG. 20. The outer retry while loop begins on line A07 and ends on line A39. Line A9 tests to see if there is an existing buffer, and if there is the first thing checked is the need to move items off the defer list to the avail list. The function is shown in FIG. 21, and it checks first on line D08 that if there is an item at the head of the list that the references to the key are now equal to zero before release the memory associated with the key D21 if the DWCAS removing it from pair_ref at line D16 succeeded. It then attempts to remove the reference from the head of the defer list at line D24 and adds it to the avail list on D25. FIG. 21 contains the generic list remove and list add, which are used to maintain both avail and defer lists, and the free_key_value function referred to on line D26.

After the defer list maintenance, the allocate_key_value function first checks if there slots in the buffer itself that are available in lines A13-A20. If no slots are available in the current buffer at the top of the buffer stack, it attempts to remove an item from the avail list if possible in lines A21-A28. If there is no buffer or no available pair_ref slots either in buffer or avail list, a new buffer is added lines A30-A38 and the loop retries to allocate a pair_ref until it succeeds.

The free_key_value in FIG. 21 attempts to remove the key pointer by atomically updating the key pointer and reference count with zero using the DWCAS on line F08 of FIG. 22, insuring that there are no active references since every accessing function should update reference count first. If the DWCAS fails, then there is an active reference that updated counter first, and the item is added to the defer list on line F17 also shown in FIG. 22. Otherwise, on successful completion, the pair_ref is cleared and the key is freed on lines F09-F13. It is then added to the avail list on F15, ready to be reallocated as needed.

The check_resize function called in hash_put on line P71 of FIG. 18 to perform the incremental resizing if needed, is shown in FIG. 23. All the accessing functions may call this check_resize function so that all calling processes aid in copying the items to the larger hash_index and the cost is amortized across multiple processes. The check_resize function simply checks that the hash_index at the start of the list has a next reference to another hash_index in the list and calls the transfer_block function.

The transfer_block function in FIG. 24 is nearly identical with the transferBlock function for the hash set in FIG. 10, with the exception that it calls the rehash function on line T32 and the new location information is returned in the rehash result struct instead of the arguments as was done with internal_add for the hash set.

The rehash function in FIG. 25 simply takes an existing pair_ref pointer and rehashes into to the current hash index. It computes the block index on line R10, and then scans the block in the for loop from line R14-R48. If it finds the pointer on line R16, a status of UPDATE_CONFLICT is returned. If it succeeds in adding to an empty slot on line R27 and then set the bit map on line R36, it returns a SUCCESS status on line R47. Line R49 tests to see if the entire block was scanned without finding an empty slot, in which case, lines R50-R67 simply expand the hash index again to accommodate the item.

The expand_index function shown in FIG. 26 is called by hash_put on line P57 in FIG. 18. It attempts to allocate and add an expanded hash index to the hash index list. If it fails because another process simultaneously expanded it already, it frees the allocation, and, if possible, advances the tail for the other process and returns SUCCESS.

The check_index_list function in FIG. 27 is called by hash_put function in FIG. 18 on line P73 and checks to see that that accessor count is zero, which means it should be safe to modify the hash index list pointers since there should be no active references. In the case of the start of the active index pointer, if on line L08 the size is zero, the transfer_block function has transferred all items to a larger index and it attempts to advance the pointer. Lines L13 to L18 check if there are unused and unreferenced items in the list, and attempts to advance the head pointer and free the removed hash index.

Once a key/value pair has been added to the map, it is possible to retrieve the value pointer based upon the key by calling the hash_get function in FIG. 28. The do/while loop on lines G12 through G29 will step through all the active hash indexes in the index list. For the current index, the block is computed on line G14, and the for loop steps through the block on lines G16 through G27 comparing the keys at line G20. A successful compare returns the successful result on ling G22, otherwise, the mask for the bit map of active slots is advanced at G26 and the loop increments to next slot. If the entire block is scanned, the index pointer is advanced at G28 and the outer do/while loop continues to the next hash index. The check_resize function call to perform incremental resize on line G32 was described with regard FIG. 23. So also, the check_index_list call on line G35 to update hash index list was previously described with regard to FIG. 27.

The compare_keys function called by the hash_get function on line G20 is presented in FIG. 29. Like the updated_existing function in FIG. 19, the function updates the reference count for the duration of the compare to prevent the key from being released concurrently while compare is taking place. If the compare succeeds on line C09, a successful result is returned, otherwise, the default NOT_FOUND status is returned.

The hash_remove function presented in FIG. 30 works essentially the same as the hash_get function in the way it steps through the hash index list with a do/while loop in lines R12-R44. Within the loop, the hash_remove function computes the block index for the current hash_index and it tests that the slot is active in the bit map and that there is a non-null pointer to the pair_ref structure. The same compare_keys function seen in FIG. 29 and as used in the hash_get function is called on line R21. If the key is found, line R25 attempts to update the bit map to deactivate the slot with the CAS call. The CAS failure indicates that a value in the block has been changed and lines R26-R32 reset the necessary variables to restart the scan of the block. The bit map being updated successfully allows the pointer to be cleared line R34 and the pair_ref returned on line R35, which results in a successful status to be returned. If no item was found the default NOT_FOUND status is returned. The function calls the previously described check_resize and check_index_list functions to perform operations related to incremental resizing.

A problem with concurrent hash maps, including those that use explicit locking, is that they have to insure that all updates for a given key occur originate with a unique process or, alternatively, simultaneous updates do not matter. The present disclosure provides an implementation that allows for simultaneous updates originating from multiple processes by providing the ability to uniquely add a key/value pair, and updates and deletes to specify the previous state or version of the item required for success. That means if another process updates the map between or after the current does a “get” and modifies the data, the process receives a status of UPDATE_CONFLICT so is aware of a simultaneous update and can retry the update operation. The update process mimics the pattern used in a CAS instruction where the previous value and the new value are provided, and the update only succeeds if the previous value is the current state.

So according to embodiments, an implementation may include a state or version counter with every result returned, which is provided with subsequent calls, thus allowing all concurrent updates by multiple processes to be detected and not depend on address pointers which could have been reused. In addition, by basing the state on a version counter, the ability to easily and safely synchronize updates between map instances that exist in different memory spaces is provided, either in separate processes or separate physical computers altogether.

The calls in this interface (hash_add, hash_update, hash_delete) are all similar in structure and function to their respective analogs of hash_put and hash_remove. The functions hash_add and hash_update are described in terms of their differences with respect to hash_put, and hash_delete is described in terms of its differences with respect to hash_remove. The addition of respecting the state associated with key is the only real difference in these functions.

The hash_add function shown in FIG. 31a-31b differs from the hash_put in a few respects. It scans the computed block in lines A17-A35, but, instead of calling update_existing on an active slot, it calls the compare_key function and breaks from the loop if keys match returning an UPDATE_CONFLICT status along with the existing state and current value so it only allows the addition of a unique key. Other than that, the compare_key function pretty much follows the form and function of the hash_put function.

The hash_update function in FIG. 32 updates an already existing item in the map so it returns a NOT_FOUND status if there is no matching key as the default. Like the hash_put function, it also calls on line U27 the update_existing function seen in FIG. 19, but with the difference that it passes the state argument to the update_existing function. The version count in the pair_ref always begins at 1 and if a value greater than 0 is passed to update_existing function, and it will return UPDATE_CONFLICT status if the status is greater than 0 and the status does not match the pair_ref version. The hash_put function always passes in a 0 so that if the keys match the version check is skipped and the item will be updated. Since this function will only update an existing item, it will not change the size of the current hash_index. The hash_delete function in FIG. 33 is nearly identical to the hash_remove function in FIG. 30. Essentially, it works the same with the exception of the pair_ref version being compared against the state argument in line D25.

While aspects the present disclosure have been described in terms of particular embodiments and illustrative figures, those of ordinary skill in the art will recognize that the invention is not limited to the embodiments or figures described. Some portions of the detailed description are presented in terms of procedures, steps, logic blocks, processing other symbolic representations of operations on data bits that can be performed on computer memory. Certain steps may be performed by some or all of hardware, software, firmware, or combinations thereof.

The program logic described indicates certain events occurring in a certain order. Those of ordinary skill in the art will recognize that the ordering of certain programming steps or program flow may be modified without affecting the overall operation performed by the preferred embodiment logic, and such modifications are in accordance with the various embodiments of the invention. Additionally, certain of the steps may be performed concurrently in a parallel process, as well as performed sequentially.

Therefore, it should be understood that the aspects of the present disclosure can be practiced with modification and alteration within the spirit and scope of the appended claims. The description is not intended to be exhaustive or to limit the invention to the precise form disclosed. It should be understood that the invention can be practiced with modification and alteration and that the invention be limited only by the claims and the equivalents thereof. 

What is claimed is:
 1. A computer-implemented method of resizing a hash index data structure, the method comprising: storing a first hash index comprising x elements, wherein x is a positive integer greater than two; creating an update counter and bit map in a cache line block structure associated with the hash index, the update counter atomically incremented in response to a bit map value being modified, the bit map indicating which elements are occupied by a value; determining that the first hash index needs to expand; allocating a second hash index, wherein the second index contains at least x+1 elements; attempting, by a first thread, to advance a first pointer from the first hash index to the second hash index; and attempting, by a second thread, to advance the first pointer from the first hash index to the second hash index; wherein only one of the first thread or the second thread will advance the first pointer based on an atomic operation.
 2. The method of claim 1, further comprising advancing the first pointer from the first hash index to the second hash index using a compare and swap.
 3. The method of claim 1, wherein determining that the hash index needs to expand comprises determining an overflow condition of the hash index.
 4. The method of claim 1, wherein, when x>3, the second hash index contains a quantity of elements equal to x times y, where y=2 or a positive multiple of
 2. 5. The method of claim 1, wherein a write operation is performed on an element of the second hash index because the last element of the first hash index is occupied by a value.
 6. The method of claim 1, wherein added write operations are blocked to the first hash index.
 7. The method of claim 1, wherein a fill pointer in a hash set is directed from the first hash index to the second hash index.
 8. The method of claim 1, wherein a current element of the first hash index is determined by performing a modulo operation wherein the numerator is derived from a value in an index field and the divisor equals x.
 9. The method of claim 8, wherein the current element represents a logical position corresponding to a value in an index field.
 10. The method of claim 1, wherein the first hash index and second hash index are associated based on a linked list data structure.
 11. The method of claim 1, further comprising storing at least one queue attribute that points to at least one attribute of a first hash index, wherein the at least one queue attribute includes one or more of: a head pointer, a read pointer, or a value corresponding to a quantity of accessors.
 12. The method of claim 1, further comprising blocking added write operations to the first hash index.
 13. A computer-implemented method of resizing a data structure, the method comprising: setting a field of a first hash index to block a thread from finding an empty slot in a bucket in the first hash index; creating an update counter and a bit map in a cache line block structure associated with the first hash index, the update counter atomically incremented in response to a bit map value being modified, and the bit map indicating which elements are occupied by a value; attempting to allocate a second hash index, wherein the second hash index is greater in size than the first hash index; attempting to allocate a third hash index, wherein the third hash index is greater in size than the first hash index; linking the second hash index to the first hash index; and deallocating the third hash index.
 14. The method of claim 13, wherein linking the second hash index to the first hash index comprises setting a local variable equal to a next pointer of the first hash index, and wherein if the next pointer of the first hash index is empty, attempting to update the next pointer of the first hash index to the second hash index, and advancing a write pointer from the first hash index to the second hash index.
 15. The method of claim 13, wherein if the attempt to allocate the second hash index was unsuccessful, return a result indicating that there is not sufficient memory.
 16. The method of claim 15, wherein if the compare and swap operation with the second hash index was successful, advancing the write pointer of the first hash index to the second hash index and free the second hash index.
 17. The method of claim 13, wherein if the next pointer of the first hash index is not empty, determine whether a compare and swap operation with the second hash index was successful.
 18. A computer-implemented method of resizing a hash index data structure, the method comprising: storing a first hash index comprising x elements, wherein x is a positive integer greater than two; creating an update counter and a bit map in a cache line block structure associated with the first hash index, the update counter atomically incremented in response to a bit map value being modified, and the bit map indicating which elements are occupied by a value; determining that the first hash index needs to expand; and allocating a second hash index, wherein the second index contains at least x+1 elements; and allocating a third hash index, wherein the third index contains at least x+1 elements; and advancing a first pointer from the first hash index to the second hash index; and deallocating the third hash index.
 19. The method of claim 18, wherein the first hash index and second hash index are associated based on a linked list data structure.
 20. The method of claim 18, further comprising storing at least one queue attribute that points to at least one attribute of the first hash index, wherein the at least one queue attribute includes one or more of: a head pointer, a read pointer, or a value corresponding to a quantity of accessors. 